Streaming XPath Processing with Forward and Backward Axes
نویسندگان
چکیده
We present a novel streaming algorithm for evaluating XPath expressions that use backward axes (parent and ancestor) and forward axes in a single document-order traversal of an XML document. Other streaming XPath processors, such as YFilter, XTrie, and TurboXPath handle only forward axes. We show through experiments that our algorithm significantly outperforms (by more than a factor of two) a traditional non-streaming XPath engine. Furthermore, since our algorithm only retains relevant portions of the input document in memory, it scales better than traditional XPath engines. It can process large documents; we have successfully tested documents over 1GB in size. On the other hand, the traditional XPath engine degrades considerably in performance for documents over 100 MB in size and fails to complete for documents of size over 200 MB.
منابع مشابه
Efficient Evaluation of Forward XPath Axes over XML Streams
Although many algorithms have been proposed for evaluating XPath queries containing un-ordered axes (child, descendant, parent and ancestor) against streaming XML data, there are very few efforts towards developing algorithms for processing path expressions with ordered axes (following, followingsibling, preceding and preceding-sibling). In this paper, we show how order information can be built...
متن کاملXPath: Looking Forward
The location path language XPath is of particular importance for XML applications since it is a core component of many XML processing standards such as XSLT or XQuery. In this paper, based on axis symmetry of XPath, equivalences of XPath 1.0 location paths involving reverse axes, such as ancestor and preceding, are established. These equivalences are used as rewriting rules in an algorithm for ...
متن کاملEarliest Query Answering for Deterministic Streaming Tree Automata and a Fragment of XPath
We study the concept of earliest query answering as neededfor streaming XML processing with optimal memory man-agement. We derive lower complexity bounds showing thatearliest query answering for Forward XPath is not feasible inpolynomial time combined complexity except if P=NP. Wethen distinguish a fragment of Forward XPath with negationthat enjoys P-time earliest query ...
متن کاملCompiling XPath into a State-less Forward-only Subset
We show how the context state of XPath, accessed through the position() and last() pseudo-functions, can be eliminated in most cases by translating references to the context state with an equivalent contextfree expression, and how this enables the use of context state in combination with a subsequent “forward-only” transformation, allowing for execution of (almost) full XPath on any of the emer...
متن کاملQuerying Streaming XML Using Visibly Pushdown Automata
We present a novel solution to streaming XPath query evaluation, capable of supporting forward and reverse axes queries. We show a conversion of an XPath query to a Visibly Pushdown Automaton that preserves the semantics of the query. It was shown in [1] that such a construction results in an automation suitable for efficient streaming query evaluation. We also show that the constructed automat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003